<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<site>sibgrapi.sid.inpe.br 802</site>
		<holdercode>{ibi 8JMKD3MGPEW34M/46T9EHH}</holdercode>
		<identifier>8JMKD3MGPEW34M/43B52AP</identifier>
		<repository>sid.inpe.br/sibgrapi/2020/09.28.04.29</repository>
		<lastupdate>2020:09.28.04.37.43 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatarepository>sid.inpe.br/sibgrapi/2020/09.28.04.29.48</metadatarepository>
		<metadatalastupdate>2022:06.14.00.00.09 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 2020}</metadatalastupdate>
		<doi>10.1109/SIBGRAPI51738.2020.00034</doi>
		<citationkey>VargasBelizarioBati:2020:MuGrLa</citationkey>
		<title>Multi-level Graph Label Propagation for Image Segmentation</title>
		<format>On-line</format>
		<year>2020</year>
		<numberoffiles>1</numberoffiles>
		<size>5887 KiB</size>
		<author>Vargas Belizario, Ivar,</author>
		<author>Batista Neto, Joao,</author>
		<affiliation>University of São Paulo</affiliation>
		<affiliation>University of São Paulo</affiliation>
		<editor>Musse, Soraia Raupp,</editor>
		<editor>Cesar Junior, Roberto Marcondes,</editor>
		<editor>Pelechano, Nuria,</editor>
		<editor>Wang, Zhangyang (Atlas),</editor>
		<e-mailaddress>l.ivarvb@gmail.com</e-mailaddress>
		<conferencename>Conference on Graphics, Patterns and Images, 33 (SIBGRAPI)</conferencename>
		<conferencelocation>Porto de Galinhas (virtual)</conferencelocation>
		<date>7-10 Nov. 2020</date>
		<publisher>IEEE Computer Society</publisher>
		<publisheraddress>Los Alamitos</publisheraddress>
		<booktitle>Proceedings</booktitle>
		<tertiarytype>Full Paper</tertiarytype>
		<transferableflag>1</transferableflag>
		<versiontype>finaldraft</versiontype>
		<keywords>image segmentation, label propagation, complex networks.</keywords>
		<abstract>This article introduces a multi-level automatic image segmentation method based on graphs and Label Propagation (LP), originally proposed for the detection of communities in complex networks, namely MGLP. To reduce the number of graph nodes, a super-pixel strategy is employed, followed by the computation of color descriptors. Segmentation is achieved by a deterministic propagation of vertex labels at each level. Several experiments with real color images of the BSDS500 dataset were performed to evaluate the method. Our method outperforms related strategies in terms of segmentation quality and processing time. Considering the Covering metric for image segmentation quality, for example, MGLP outperforms LPCI-SP, its most similar counterpart, in 38.99%. In term of processing times, MGLP is 1.07 faster than LPCI-SP.</abstract>
		<language>en</language>
		<targetfile>117.pdf</targetfile>
		<usergroup>l.ivarvb@gmail.com</usergroup>
		<visibility>shown</visibility>
		<documentstage>not transferred</documentstage>
		<mirrorrepository>sid.inpe.br/banon/2001/03.30.15.38.24</mirrorrepository>
		<nexthigherunit>8JMKD3MGPEW34M/43G4L9S</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/4742MCS</nexthigherunit>
		<citingitemlist>sid.inpe.br/sibgrapi/2020/10.28.20.46 4</citingitemlist>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<username>l.ivarvb@gmail.com</username>
		<agreement>agreement.html .htaccess .htaccess2</agreement>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/sibgrapi/2020/09.28.04.29</url>
	</metadata>
</metadatalist>